Extending Alignment Algorithm for Polyphonic Comparison
نویسندگان
چکیده
Existing symbolic music comparison systems generally consider monophonic music or monophonic reduction of polyphonic music. Adaptation of alignment algorithms to the music leads to accurate systems, but extensions to polyphonic music arise new problems. Indeed, a chord may match several notes, or the difference between two similar motifs may be a few swapped notes. Moreover, it is difficult to set up the substitution scores between chords. In this paper, we propose a general framework for polyphonic music which permits to directly apply the substitution score scheme set for monophonic music, and which allows new operations by extending the operations proposed by Mongeau and Sankoff [1]. From a practical point of view, the limitations of the size of chords and the number of notes that can be merged lead to a complexity that remains quadratic.
منابع مشابه
Toward a General Framework for Polyphonic Comparison
Existing symbolic music comparison systems generally consider monophonic music or monophonic reduction of polyphonic music. Adaptation of alignment algorithms to music leads to accurate systems, but their extensions to polyphonic music raise new problems. Indeed, a chord may match several consecutive notes, or the difference between two similar motifs may be a few swapped notes. Moreover, the s...
متن کاملPolyphonic Musical Sequence Alignment for Database Search
Finding the best matching database target to a melodic query has been of great interest in the music IR world. The string alignment paradigm works well for this task when comparing a monophonic query to a database of monophonic pieces. However, most tonal music is polyphonic, with multiple concurrent musical lines. Such pieces are not adequately represented as strings. Moreover, users often rep...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملA Robust Retrieval System of Polyphonic Music Based on Comparison of Chord Sequences
Retrieval systems for polyphonic music rely on the automatic estimation of the similarity between two musical pieces. In the case of symbolic music, existing systems consider a monophonic reduction based on melody or propose algorithms with high complexity. In this paper, a new approach is presented. Musical pieces are represented as a sequence of chords estimated from groups of notes sounding ...
متن کاملModeling of Phoneme Durations for Alignment between Polyphonic Audio and Lyrics
In this work we propose how to modify a standard approach to text-to-speech alignment for solving the problem of alignment of lyrics and singing voice. To this end we model the duration of phonemes, specific to the case of singing. We rely on a duration-explicit hidden Markov model (DHMM) phonetic recognizer based on mel frequency cepstral coefficients (MFCCs), which are extracted in a way robu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009